Biorthogonally accessed three-dimensional two-photon memory for relational database operations.

نویسندگان

  • B H Olson
  • R Paturi
  • S C Esener
چکیده

Memory bandwidth is a bottleneck for very large database machines. Parallel-access three-dimensional two-photon memories have the potential of achieving enormous throughput (>100 Gbit/s) and capacity (1 Tbit/cm(3)) [Appl. Opt. 29, 2058 (1990)] and, consequently, are well suited for this application. Our analysis shows that some operations can be completed more than 2 orders of magnitude faster with this type of memory than with a system based on serial-access storage. These particular memories have a further feature of being accessible in orthogonal directions. We show that this property, used in conjunction with a three-dimensional data-organization scheme designed for this approach, leads to improved performance by permitting the user a choice of accessing strategies for a given operation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Index Data Structure for Fast Subset and Superset Queries

A new data structure set-trie for storing and retrieving sets is proposed. Efficient manipulation of sets is vital in a number of systems including datamining tools, object-relational database systems, and rule-based expert systems. Data structure set-trie provides efficient algorithms for set containment operations. It allows fast access to subsets and supersets of a given parameter set. The p...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Relational Algebra Operations

Relational algebra is the instruction set of relational database systems. In this paper, a set of relational algebra operations are described and slightly enhanced for improved efficiency. How these routines can be implemented on a parallel database computer is described in detail. Four operations are handled: projection, join, aggregation and division. The implemantation is heavyly based on ha...

متن کامل

An Unified Dynamic Description Logic Model for Databases: Relational Data, Relational Operations and Queries

The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to logical systems with enriched semantics and enhanced reasoning mechanism. A typical relational database model comprises three components: relational data model, relational operations, and queries. Therefore, a DL mode...

متن کامل

Main Memory Databases vs. Disk-Resident Databases

Storing all database data in memory is an idea that many researchers have been studying it from mid-1980s when RAM prices decreased while their capacity increased. Main Memory Database systems (MMDB) are an efficient solution to store all database data in main physical memory. Conventional database systems like relational databases are optimized for disk I/O operations but Memory resident datab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied optics

دوره 36 17  شماره 

صفحات  -

تاریخ انتشار 1997